A Simple Yet Effective Merging Scheme for Prescribed-Skew Clock Routing
نویسندگان
چکیده
In order to achieve multi-GHz operation frequency for VLSI design, clock networks need to be designed in a very elaborated manner and be able to deliver prescribed useful skews rather than merely zero-skew. Although traditional zero-skew clock routing methods can be extended directly to prescribed skews, they tend to result in excessive wirelength as the differences among delay-targets for clock sinks are neglected. In this paper, we propose the maximum delay-target and minimum merging-cost merging scheme for prescribed-skew clock routing. This scheme is simple yet surprisingly effective on wirelength reduction. Experimental results on benchmark circuits show that our merging scheme yields 53%-61% wirelength reduction compared to traditional clock routing
منابع مشابه
Navigating Register Placement for Low Power Clock Network
With VLSI design development, the increasingly severe power problem requests to minimize clock routing wirelength so that both power consumption and power supply noise can be alleviated. In contrast to most of traditional works that handle this problem only in clock routing, we propose to navigate standard cell register placement to locations that enable further less clock routing wirelength an...
متن کاملUST/DME: a clock tree router for general skew constraints - Computer Aided Design, 2000. ICCAD-2000. IEEE/ACM International Conference on
In this paper, we propose new approaches for solving the usefulskew tree (UST) routing problem [17]: Clock routing subject to general skew constraints. The clock layout synthesis engine of our UST algorithms is based on the deferred-merge embedding (DME) paradigm for zero-skew tree [5; 11 and bounded-skew tree [8; 21 routings; hence, the names UST/DME and Greedy-UST/DME for our algorithms. They...
متن کاملAn Algorithm for Zero-Skew Clock Tree Routing with Bu er Insertion
We study the problem of multi-stage zero skew clock tree construction for minimizing clock phase delay and wirelength. In existing approaches clock bu ers are inserted only after clock tree is constructed. The novelty of this paper lies in simultaneously perform clock tree routing and bu er insertion. We propose a clustering-based algorithm which uses shortest delay as the cost function. We sho...
متن کاملA Multiple Level Network Approach for Clock Skew Minimization Under Process Variations
In this paper, we investigate the effect of multilevel networks on clock skew. We first define the simplified RC circuit model of a hybrid clock mesh/tree structure. The skew reduction effects of shunt segments contributed by the mesh is derived analytically from the simplified model. The result indicates that the skew decreases proportionally to the exponential of −Rs/R, where Rs is the drivin...
متن کاملTestable Clock Routing Architecture for Field Programmable Gate Arrays
Abstract This paper describes an efficient methodology for testing dedicated clock lines in Field Programmable Gate Arrays (FPGAs). A H-tree based clocking architecture is proposed along with a test scheme. The Htree architecture provides optimal clock skew characteristics. The H-tree architecture consumes at least 25% less of the routing resources when compared to conventional clock routing sc...
متن کامل